An Algorithm for Finding All the Spanning Trees in Undirected Graphs
نویسنده
چکیده
In this paper, we propose an algorithm for nding all the spanning trees in undirected graphs. The algorithm requires O(n +m + n) time and O(n +m) space, where the given graph has n vertices, m edges and spanning trees. For outputting all the spanning trees explicitly, this algorithm is optimal.
منابع مشابه
A Study on ‘Number of Spanning Trees’
Char, J. P. , Generation of Trees, Two-Trees and Storage of Master Forests, IEEE Transactions on Circuit Theory, Vol. CT-15, pp. 128-138, 1968. Hakimi, S. L. , On Trees of a Graph and their Generation, Journal of the Franklin Institute, Vol. 272, No. 5, pp. 347-359, 1961. Kapoor, S. and H. Ramesh, Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs, SIAM Journal on C...
متن کاملAlgorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
In this paper, we present algorithms for enumeration of spanning trees in undi-rected graphs, with and without weights. The algorithms use a search tree technique to construct a computation tree. The computation tree can be used to output all spanning trees by outputting only relative changes between spanning trees rather than the entire spanning trees themselves. Both the construction of the c...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملAn Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
Let G be an undirected graph with V vertices and E edges. Many algorithms have been developed for enumerating all spanning trees in G. Most of the early algorithms use a technique called `backtracking'. Recently, several algorithms using a di erent technique have been proposed by Kapoor and Ramesh (1992), Matsui (1993), and Shioura and Tamura (1993). They nd a new spanning tree by exchanging on...
متن کامل